Control and Cybernetics a Remark on Sensitivity in Linear Programming and Gale-samuelson Nonsubstitution Theorem

Nonsubstitution Theorems for a Small Trading Country

One of the elegant gems of modern economic theory is Paul Samuelson’s nonsubstitution theorem. Samuelson (1951) showed that a surprisingly rich class of closed economies behave in general competitive equilibrium as if production were of the Leontief fixed coefficient form. Though Samuelson’s assumptions allow the possibility of neoclassically smooth substitution among many inputs, his nonsubsti...

Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem

In this paper we investigate the asymptotic stability of dynamic, multipleobjective linear programs. In particular, we show that a generalization of the optimal partition stabilizes for a large class of data functions. This result is based on a new theorem about asymptotic sign-solvable systems. The stability properties of the generalized optimal partition are used to extend a dynamic version o...

Presentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem

The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on. It has been proven that even the general bi-level programming problem is an NP-hard problem, so the multi-level problems are practical and complicated problems therefo...

A Remark on a Remark by Macaulay or Enhancing Lazard Structural Theorem

SOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING

Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...